Alternation Is Strict For Higher-Order Modal Fixpoint Logic
نویسندگان
چکیده
منابع مشابه
Alternation Is Strict For Higher-Order Modal Fixpoint Logic
We study the expressive power of Alternating Parity Krivine Automata (APKA), which provide operational semantics to Higher-Order Modal Fixpoint Logic (HFL). APKA consist of ordinary parity automata extended by a variation of the Krivine Abstract Machine. We show that the number and parity of priorities available to an APKA form a proper hierarchy of expressive power as in the modal μ-calculus. ...
متن کاملThe alternation hierarchy in fixpoint logic with chop is strict too
Fixpoint Logic with Chop extends the modal μ-calculus with a sequential composition operator which results in an increase in expressive power. We develop a game-theoretic characterisation of its model checking problem and use these games to show that the alternation hierarchy in this logic is strict. The structure of this result follows the lines of Arnold’s proof showing that the alternation h...
متن کاملTopos Semantics for Higher-Order Modal Logic
We define the notion of a model of higher-order modal logic in an arbitrary elementary topos E . In contrast to the wellknown interpretation of (non-modal) higher-order logic, the type of propositions is not interpreted by the subobject classifier ΩE , but rather by a suitable complete Heyting algebra H . The canonical map relating H and ΩE both serves to interpret equality and provides a modal...
متن کاملModal Higher-order Logic for Agents
This paper introduces a modal higher-order logic for representing belief states of agents. The syntax and semantics of the logic and a tableau system for proving theorems are presented and an indication given as to how the logic can be used for building multi-agent systems. The main ideas are illustrated by an extended example concerning a user agent for the Internet.
متن کاملCapturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint Logic
Polyadic Higher-Order Fixpoint Logic (PHFL) is a modal fixpoint logic obtained as the merger of Higher-Order Fixpoint Logic (HFL) and the Polyadic μ-Calculus. Polyadicity enables formulas to make assertions about tuples of states rather than states only. Like HFL, PHFL has the ability to formalise properties using higher-order functions. We consider PHFL in the setting of descriptive complexity...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2016
ISSN: 2075-2180
DOI: 10.4204/eptcs.226.8